TRANSITIVE t - DESIGNS AND STRONGLY REGULAR GRAPHS CONSTRUCTED FROM LINEAR GROUPS L ( 2 , q ) , q ≤ 23
نویسندگان
چکیده
In this paper we construct transitive t-designs from the linear groups L(2, q), q ≤ 23. Thereby we classify t-designs, t ≥ 2, admitting a transitive action of the linear groups L(2, q), q ≤ 23, up to 35 points and obtained numerous transitive designs, for 36 ≤ v ≤ 55. In many cases we proved the existence of t-designs with certain parameter sets. Among others we constructed t-designs with parameters 2(55, 10, 4), 3-(24, 11, 495), 3-(24, 12, 5m),m ∈ {11, 12, 22, 33, 44, 66, 132}. Furthermore, we constructed strongly regular graphs admitting a transitive action of the linear groups L(2, q), q ≤ 23.
منابع مشابه
A Prolific Construction of Strongly Regular Graphs with the n-e.c. Property
A graph is n-e.c. (n-existentially closed) if for every pair of subsets U , W of the vertex set V of the graph such that U ∩W = / 0 and |U |+ |W | = n, there is a vertex v ∈ V − (U ∪W ) such all edges between v and U are present and no edges between v and W are present. A graph is strongly regular if it is a regular graph such that the number of vertices mutually adjacent to a pair of vertices ...
متن کاملOn Some Combinatorial Structures Constructed from the Groups L 3 , 5 , U 5 , 2 , and S 6 , 2 Dean
We describe a construction of primitive 2-designs and strongly regular graphs from the simple groups L 3, 5 , U 5, 2 , and S 6, 2 . The designs and the graphs are constructed by defining incidence structures on conjugacy classes of maximal subgroups of L 3, 5 , U 5, 2 , and S 6, 2 . In addition, from the group S 6, 2 , we construct 2-designs with parameters 28, 4, 4 and 28, 4, 1 having the full...
متن کاملNew Regular Partial Difference Sets and Strongly Regular Graphs with Parameters (96, 20, 4, 4) and (96, 19, 2, 4)
New (96,20,4,4) and (96,19,2,4) regular partial difference sets are constructed, together with the corresponding strongly regular graphs. Our source are (96,20,4) regular symmetric designs.
متن کاملDirected strongly regular graphs obtained from coherent algebras
The notion of a directed strongly regular graph was introduced by A. Duval in 1988 as one of the possible generalizations of classical strongly regular graphs to the directed case. We investigate this generalization with the aid of coherent algebras in the sense of D.G. Higman. We show that the coherent algebra of a mixed directed strongly regular graph is a non-commutative algebra of rank at l...
متن کاملOn the Normal Structure of a One-point Stabilizer in a Doubly Transitive Permutation Group
Let G be a doubly transitive permutation group on a finite set fi, and let K" be a normal subgroup of the stabilizer Ga of a point a in £2. If the action of Ga on the set of orbits of K" in £2—{a} is 2-primitive with kernel K" it is shown that either G is a normal extension of PSL(3, q) or K" n Gy is a strongly closed subgroup of Gay in Ga, where y e £2—{a}. If in addition the action of Go on t...
متن کامل